Solving geometric constraint systems. II. A symbolic approach and decision of Rc-constructibility
نویسندگان
چکیده
منابع مشابه
Solving geometric constraint systems. II. A symbolic approach and decision of Rc-constructibility
This paper reports a geometric constraint solving approach based on symbolic computation. With this approach, we can compute robust numerical solutions for a set of equations. We give complete methods of deciding whether the constraints are independent and whether a constraint system is over-constraint. Also, over-constrainted systems can be handled naturally. Based on symbolic computation, we ...
متن کاملSymbolic Constraints in Constructive Geometric Constraint Solving
In design and manufacturing applications users of computer aided de sign systems want to de ne relationships between dimension variables since such relationships express design intent very exibly This work reports on a technique developed to enhance a class of constructive geometric con straint solvers with the capability of managing functional relationships be tween dimension variables The met...
متن کاملSolving Geometric Constraint Systems
Finding the con gurations of a set of rigid bodies that satisfy a set of geometric constraints is a problem traditionally solved by reformulating the geometry and constraints as algebraic equations which are solved symbolically or numerically. But many such problems can be solved by reasoning symbolically about the geometric bodies themselves using a new technique called degrees of freedom anal...
متن کاملA Constraint Programming Approach for Solving Rigid Geometric Systems
This paper introduces a new rigidification method -using interval constraint programming techniquesto solve geometric constraint systems. Standard rigidification techniques are graph-constructive methods exploiting the degrees of freedom of geometric objects. They work in two steps: a planning phase which identifies rigid clusters, and a solving phase which computes the coordinates of the geome...
متن کاملSymbolic Automata Constraint Solving
Constraints over regular and context-free languages are common in the context of string-manipulating programs. Efficient solving of such constraints, often in combination with arithmetic and other theories, has many useful applications in program analysis and testing. We introduce and evaluate a method for symbolically expressing and solving constraints over automata, including subset constrain...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer-Aided Design
سال: 1998
ISSN: 0010-4485
DOI: 10.1016/s0010-4485(97)00055-9